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 listJul 31, 2026 13:09George SeabridgeGeorge SeabridgeScore: 60,011Success
Source Code

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

Challenge History

No challenges yet.

Run Statistics
#DateScoreWall TimeCPU UserCPU SystemMemoryError
1Jul 31, 2026 13:0959,154501,167,832489,837,0001,144,0002,117,632
2Jul 31, 2026 13:0959,991507,894,459496,775,0001,152,0002,117,632
3Jul 31, 2026 13:0959,993508,066,606496,745,0001,201,0002,117,632
4Jul 31, 2026 13:0959,995507,970,928496,769,0001,190,0002,117,632
5Jul 31, 2026 13:0960,011508,118,462496,957,0001,141,0002,117,632
6Jul 31, 2026 13:0960,047508,413,970497,255,0001,136,0002,117,632
7Jul 31, 2026 13:0960,055508,439,177497,453,0001,008,0002,117,632
8Jul 31, 2026 13:0960,174509,500,973498,307,0001,139,0002,117,632
9Jul 31, 2026 13:0960,193509,589,098498,427,0001,177,0002,117,632