Parse integers Sergey Svistunov

Compute the sum of integers read from STDIN as fast as possible.

Input: 50 000 000 lines, each containing one integer in the range [0; 2147483647].

629871117
2024562523
1372689083
1021777120
2111176472

Output: The uint64 sum of all numbers, printed as a decimal string.

Note: Integer overflow is expected – use a 64-bit accumulator.

Back to listSep 3, 2026 16:35CheckHarryCheckHarryScore: 4,594Success
Source Code

Source code access is restricted. Log in to request access.

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Sep 3, 2026 16:364,57847,818,74236,987,0001,016,0002,113,536
2Sep 3, 2026 16:364,58348,114,78837,028,0001,017,0002,113,536
3Sep 3, 2026 16:364,58948,574,54037,076,0001,015,0002,113,536
4Sep 3, 2026 16:364,59047,984,38237,087,0001,017,0002,113,536
5Sep 3, 2026 16:364,59448,613,58637,106,0001,031,0002,113,536
6Sep 3, 2026 16:364,65648,558,72437,630,0001,018,0002,113,536
7Sep 3, 2026 16:364,68848,796,65237,899,0001,015,0002,113,536
8Sep 3, 2026 16:364,77749,504,14638,627,0001,028,0002,113,536
9Sep 3, 2026 16:364,80149,702,49738,838,0001,014,0002,113,536