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 listApr 1, 2026 20:35leoweleoweScore: 145,124Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 1, 2026 20:35145,0081,228,022,4421,137,587,00065,976,0002,265,088
2Apr 1, 2026 20:35145,0311,232,015,5881,134,773,00068,986,0002,269,184
3Apr 1, 2026 20:35145,0501,234,200,0991,143,923,00059,996,0002,273,280
4Apr 1, 2026 20:35145,0861,230,170,1101,144,252,00059,960,0002,289,664
5Apr 1, 2026 20:35145,1241,230,067,8161,144,557,00059,976,0002,269,184
6Apr 1, 2026 20:35145,1291,232,337,1001,142,593,00061,977,0002,269,184
7Apr 1, 2026 20:35145,2171,233,365,7461,122,351,00082,952,0002,519,040
8Apr 1, 2026 20:35145,2311,225,919,1901,136,454,00068,966,0002,281,472
9Apr 1, 2026 20:35145,3181,234,250,3321,146,185,00059,957,0002,289,664