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 16, 2026 12:04Eric CeglieEric CeglieScore: 9,341Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Mar 16, 2026 11:589,295100,760,88476,145,0001,001,0002,506,752
2Mar 16, 2026 12:049,31698,243,23974,311,0003,012,0002,494,464
3Mar 16, 2026 11:589,317103,552,37676,326,0001,004,0002,457,600
4Mar 16, 2026 12:049,341108,175,32875,515,0002,013,0002,289,664
5Mar 16, 2026 12:049,362107,024,45075,689,0002,018,0002,494,464
6Mar 16, 2026 11:589,379101,366,37574,849,0002,993,0002,289,664