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 listJan 4, 2026 04:28Josu San MartinJosu San MartinScore: 6,005Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jan 4, 2026 04:285,71668,144,10746,432,0001,009,0002,281,472
2Jan 4, 2026 04:285,76079,203,39646,816,000996,0002,273,280
3Jan 4, 2026 04:285,91368,081,54347,076,0002,003,0002,441,216
4Jan 4, 2026 04:286,00568,747,39047,845,0001,993,0002,445,312
5Jan 4, 2026 04:286,18073,227,91849,279,0002,011,0002,449,408
6Jan 4, 2026 04:286,31574,377,87551,409,0001,008,0002,273,280