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 13, 2026 19:40Yuriy LyfenkoYuriy LyfenkoScore: 4,379Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Apr 13, 2026 19:414,35760,120,62134,156,0002,009,0002,535,424
2Apr 13, 2026 19:414,35960,042,97634,171,0002,010,0002,535,424
3Apr 13, 2026 19:404,37762,467,19834,315,0002,018,0002,469,888
4Apr 13, 2026 19:404,37761,483,83135,319,0001,009,0002,473,984
5Apr 13, 2026 19:404,37965,947,36735,339,0001,009,0002,535,424
6Apr 13, 2026 19:404,38161,086,30035,354,0001,010,0002,473,984
7Apr 13, 2026 19:414,38656,762,70335,389,0001,011,0002,469,888
8Apr 13, 2026 19:404,38959,890,38035,416,0001,011,0002,473,984
9Apr 13, 2026 19:404,40665,516,07535,557,0001,015,0002,473,984