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 listMar 17, 2026 16:27caandocaandoScore: 4,891Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 17, 2026 16:244,83663,393,53437,125,0003,010,0002,285,568
2Mar 17, 2026 16:274,85366,906,08637,256,0003,020,0002,322,432
3Mar 17, 2026 16:244,86363,844,24338,348,0002,018,0002,490,368
4Mar 17, 2026 16:244,89167,725,43538,569,0002,029,0002,482,176
5Mar 17, 2026 16:274,95262,659,53038,091,0003,007,0002,285,568
6Mar 17, 2026 16:275,05667,320,57739,967,0001,998,0002,318,336