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 listJul 9, 2026 18:12Victor MerckléVictor MerckléScore: 73,494Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 9, 2026 18:1372,478609,672,216600,447,0001,124,0002,117,632stderr
2Jul 9, 2026 18:1372,625611,390,689601,770,0001,018,0002,117,632stderr
3Jul 9, 2026 18:1372,774612,020,054602,895,0001,130,0002,117,632stderr
4Jul 9, 2026 18:1373,033614,362,678605,081,0001,101,0002,117,632stderr
5Jul 9, 2026 18:1373,494618,165,905608,987,0001,021,0002,117,632stderr
6Jul 9, 2026 18:1373,548618,700,727609,437,0001,017,0002,117,632stderr
7Jul 9, 2026 18:1373,583618,899,516609,624,0001,121,0002,117,632stderr
8Jul 9, 2026 18:1373,680619,707,696610,526,0001,024,0002,117,632stderr
9Jul 9, 2026 18:1373,948621,977,314612,685,0001,091,0002,117,632stderr